package leetcode.Fiftyone_to_One_hundred;

/**
 * 搜索旋转排序数组 II
 */
public class Test81 {

    public boolean search(int[] nums, int target) {
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] == target)
                return true;
        }
        return false;
    }
}
